翻訳と辞書
Words near each other
・ Typekit
・ TypeMatrix
・ Typename
・ Typenturm
・ Typeof
・ TypePad
・ TypeParameter
・ TypeRacer
・ Types and Programming Languages
・ Types of abortion restrictions in the United States
・ Types of artificial neural networks
・ Types of Bakuvian Bazaars
・ Type class
・ Type code
・ Type color
Type constructor
・ Type Control
・ Type conversion
・ Type D escort ship
・ Type D personality
・ Type D submarine
・ Type Description Language
・ Type design
・ Type Directors Club
・ Type enforcement
・ Type erasure
・ Type family
・ Type foundry
・ Type Four platform
・ Type generalization


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Type constructor : ウィキペディア英語版
Type constructor
In the area of mathematical logic and computer science known as type theory, a type constructor is a feature of a typed formal language that builds new types from old ones. Typical type constructors encountered are product types, function types, power types and list types. Basic types are considered nullary type constructors. New types can be defined by recursively composing type constructors.
For example, simply typed lambda calculus can be seen as a language with a single type constructor—the function type constructor. Product types can generally be considered "built-in" in typed lambda calculi via currying.
Abstractly, a type constructor is an ''n''-ary type operator taking as argument zero or more types, and returning another type. Making use of currying, ''n''-ary type operators can be (re)written as a sequence of applications of unary type operators. Therefore, we can view the type operators as a simply typed lambda calculus, which has only one basic type, usually denoted
*, and pronounced "type", which is the type of all types in the underlying language, which are now called ''proper types'' in order to distinguish them from the types of the type operators in their own calculus, which are called ''kinds''.
Instituting a simply typed lambda calculus over the type operators results in more than just a formalization of type constructors though. Higher-order type operators become possible. (See Kind (type theory) for some examples.) Type operators correspond to the 2nd axis in the lambda cube, leading to the simply typed lambda-calculus with type operators, λω; while this is not so well known, combining type operators with polymorphic lambda calculus (system F) yields system F-omega.
==See also==

* Algebraic data type
* Recursive data type

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Type constructor」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.